Product form solution for g-networks with dependent service
نویسندگان
چکیده
منابع مشابه
Product form solution for g-networks with dependent service
We consider a G-network with Poisson flow of positive customers. Each positive customer entering the network is characterized by a set of stochastic parameters: customer route, the length of customer route, customer volume and his service length at each route stage as well. The following node types are considered: (0) an exponential node with cn servers, infinite buffer and FIFO discipline; (1)...
متن کاملProduct - form in G - networks
The introduction of the class of queueing networks called G-networks by Gelenbe has been a breakthrough in the field of stochastic modelling since it has largely expanded the class of models which are analytically or numerically tractable. From a theoretical point of view, the introduction of the G-networks has lead to very important considerations: first, a product-form queueing network may ha...
متن کاملSemi-Product-Form Solution for Models with State-Dependent Rates
In this paper we consider the problem of finding a decomposed solution to a Markov model where the action rates may depend on the global state space. To do this we consider regular cycles in the underlying state space and show that a semi-product form solution exists when the functions describing the action rates have specific forms. The approach is illustrated with a simple queueing example al...
متن کاملA Product Form Solution for Tree Networks with Divisible Loads
A product form solution for the optimal fractions of divisible load to distribute to processors in a multi-level tree network is described. Here optimality involves parallel processing the load in a minimal amount of time. This tractable solution is similar to the product form solution for equilibrium state probabilities arising in Markovian queueing networks. The existence of this product form...
متن کاملMean Value Analysis of Product Form Solution Queueing Networks with Repetitive Service Blocking
Queueing network models with finite capacity queues and blocking are used to represent systems with resource constraints, such as production, communication and computer systems. Various blocking mechanisms have been defined in the literature to represent the different behaviours of real systems with limited resources. Queueing networks with blocking have a product form solution under special co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Operations Research
سال: 2004
ISSN: 0399-0559,1290-3868
DOI: 10.1051/ro:2004015